Fast deflated conjugate gradient method with proper orthogonal decomposition for topology optimization
نویسندگان
چکیده
منابع مشابه
Gradient-enhanced surrogate modeling based on proper orthogonal decomposition
A new method for enhanced surrogate modeling of complex systems by exploiting gradient information is presented. The technique combines the proper orthogonal decomposition (POD) and interpolation methods capable of fitting both sampled input values and sampled derivative information like Kriging (aka spatial Gaussian processes). In contrast to existing POD-based interpolation approaches, the gr...
متن کاملAn Efficient Conjugate Gradient Algorithm for Unconstrained Optimization Problems
In this paper, an efficient conjugate gradient method for unconstrained optimization is introduced. Parameters of the method are obtained by solving an optimization problem, and using a variant of the modified secant condition. The new conjugate gradient parameter benefits from function information as well as gradient information in each iteration. The proposed method has global convergence und...
متن کاملOn the hybrid conjugate gradient method for solving fuzzy optimization problem
In this paper we consider a constrained optimization problem where the objectives are fuzzy functions (fuzzy-valued functions). Fuzzy constrained Optimization (FO) problem plays an important role in many fields, including mathematics, engineering, statistics and so on. In the other side, in the real situations, it is important to know how may obtain its numerical solution of a given interesting...
متن کاملNumerical Optimization Lecture 13: Conjugate Gradient Method
We still need to show that the directions p0, p1, . . . , pn−1 generated by Algorithms 1 and (2) are conjugate wrt A. If so, then by Theorem 11.3, this algorithm will terminate in n steps. The next theorem shows this property, along with two other important properties: (i) the residuals ri are mutually orthogonal, and (ii) each pk and rk is contained in the Krylov subspace of degree k for r0, d...
متن کاملA new hybrid conjugate gradient algorithm for unconstrained optimization
In this paper, a new hybrid conjugate gradient algorithm is proposed for solving unconstrained optimization problems. This new method can generate sufficient descent directions unrelated to any line search. Moreover, the global convergence of the proposed method is proved under the Wolfe line search. Numerical experiments are also presented to show the efficiency of the proposed algorithm, espe...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Advanced Simulation in Science and Engineering
سال: 2021
ISSN: 2188-5303
DOI: 10.15748/jasse.8.154